Nash

Results: 2621



#Item
321Nail Kashaev: Curriculum Vitae

Nail Kashaev: Curriculum Vitae

Add to Reading List

Source URL: www.personal.psu.edu

Language: English - Date: 2015-11-04 20:13:55
322Nash  Figure 68. Wanderer (Old Believer). Neg. No.IV.DMF.1.19.h. The top of his right hand is 34 cm high. 56

Nash Figure 68. Wanderer (Old Believer). Neg. No.IV.DMF.1.19.h. The top of his right hand is 34 cm high. 56

Add to Reading List

Source URL: dmns.org

Language: English - Date: 2014-11-06 19:41:58
323SS 201b, Homework 7 Due Tuesday, February 23rd Collaboration on homework is encouraged, but individually written solutions are required. Please name all collaborators and sources of information on each assignment. Any su

SS 201b, Homework 7 Due Tuesday, February 23rd Collaboration on homework is encouraged, but individually written solutions are required. Please name all collaborators and sources of information on each assignment. Any su

Add to Reading List

Source URL: people.hss.caltech.edu

Language: English - Date: 2016-06-13 13:31:39
324Index ε-Nash equilibrium, 9 H ∞ -optimal control, 23, 130 as linear-quadratic differential game, 94 σ -algebra, 261

Index ε-Nash equilibrium, 9 H ∞ -optimal control, 23, 130 as linear-quadratic differential game, 94 σ -algebra, 261

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2016-03-01 14:18:21
    325T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing

    T HEORY OF C OMPUTING, Volume), pp. 179–199 www.theoryofcomputing.org Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing

    Add to Reading List

    Source URL: users.cms.caltech.edu

    Language: English - Date: 2011-09-16 11:55:12
      326arXiv:1211.2405v1  [cs.GT]  11 Nov 2012

      arXiv:1211.2405v1 [cs.GT] 11 Nov 2012

      Add to Reading List

      Source URL: www.maths.lse.ac.uk

      Language: English - Date: 2012-11-13 09:27:35
      327Transiting Areas Patrolled by a Mobile Adversary Ondˇrej Vanˇek, Branislav Boˇsansk´y, Michal Jakob and Michal Pˇechouˇcek which it chooses a closed-walk starting and ending in a given location in the area, termed

      Transiting Areas Patrolled by a Mobile Adversary Ondˇrej Vanˇek, Branislav Boˇsansk´y, Michal Jakob and Michal Pˇechouˇcek which it chooses a closed-walk starting and ending in a given location in the area, termed

      Add to Reading List

      Source URL: game.itu.dk

      Language: English - Date: 2010-08-10 12:41:00
      328OPERATIONS RESEARCH Vol. 62, No. 6, November–December 2014, pp. 1221–1235 ISSN 0030-364X (print) — ISSNonline) http://dx.doi.orgopre © 2014 INFORMS

      OPERATIONS RESEARCH Vol. 62, No. 6, November–December 2014, pp. 1221–1235 ISSN 0030-364X (print) — ISSNonline) http://dx.doi.orgopre © 2014 INFORMS

      Add to Reading List

      Source URL: www.maths.lse.ac.uk

      Language: English - Date: 2015-01-06 17:06:38
      329Equilibrium Algorithms for Two-Player Games  Bernhard von Stengel Department of Mathematics London School of Economics

      Equilibrium Algorithms for Two-Player Games Bernhard von Stengel Department of Mathematics London School of Economics

      Add to Reading List

      Source URL: www.maths.lse.ac.uk

      Language: English - Date: 2014-08-14 14:00:46
      330EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS ¨ DEMETRES CHRISTOFIDES, DANIELA KUHN AND DERYK OSTHUS Abstract. In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every α >

      EDGE-DISJOINT HAMILTON CYCLES IN GRAPHS ¨ DEMETRES CHRISTOFIDES, DANIELA KUHN AND DERYK OSTHUS Abstract. In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every α >

      Add to Reading List

      Source URL: web.mat.bham.ac.uk

      Language: English - Date: 2011-10-06 08:51:22